package CareerUp.RemoveSet;

/**
 * Given N sets of integers, remove some sets so that the remaining all sets are
 * disjoint with one another. Find the optimal solution so that the number of
 * sets remaining at the end is maximum. please explain your algorithm properly
 * rather than pasting code .
 * 
 * @author Xi
 * 
 */
public class RemoveSet {

	/**
	 * this seems to be NPC, so the only way is to exhausting every possible
	 * answers
	 */
}
